Formalization and Automated Verification of RESTful Behavior
نویسندگان
چکیده
REST is a software architectural style used for the design of highly scalable web applications. Interest in REST has grown rapidly over the past decade, spurred by the growth of open web APIs. On the other hand, there is also considerable confusion surrounding REST: many examples of supposedly RESTful APIs violate key REST constraints. We show that the constraints of REST and of RESTful HTTP can be precisely formulated within temporal logic. This leads to methods for model checking and run-time verification of RESTful behavior. We formulate several relevant verification questions and analyze their complexity.
منابع مشابه
Formalization and Verification of Number Theoretic Algorithms Using the Mizar Proof Checker
In this paper, we introduce formalization of well-known number theoretic algorithms on the Mizar proof checking system. We formalized the Euclidean algorithm, the extended Euclidean algorithm and the algorithm computing the solution of the Chinese reminder theorem based on the source code of NZMATH which is a Python based number theory oriented calculation system. We prove the accuracy of our f...
متن کاملFace Detection with methods based on color by using Artificial Neural Network
The face Detection methodsis used in order to provide security. The mentioned methods problems are that it cannot be categorized because of the great differences and varieties in the face of individuals. In this paper, face Detection methods has been presented for overcoming upon these problems based on skin color datum. The researcher gathered a face database of 30 individuals consisting of ov...
متن کاملTrustworthy Virtualization of the ARMv7 Memory Subsystem
In order to host a general purpose operating system, hypervisors need to virtualize the CPU memory subsystem. This entails dynamically changing MMU resources, in particular the page tables, to allow a hosted OS to reconfigure its own memory. In this talk I present the verification of the isolation properties of a hypervisor design that uses direct paging. This virtualization approach allows to ...
متن کاملFormal Verification of a Theory of IEEE Rounding
We report on the formal verification of a theory of IEEE rounding in the theorem prover PVS. The theory consists of a formalization of the IEEE standard, and notations and theorems facilitating the verification of floating point hardware. In particular, the concepts of -equivalence and round decomposition are formalized, allowing for a subdivision of floating point units into smaller building b...
متن کاملTopics in Formal Synthesis and Modeling
The work reported here focuses on two problems, that of synthesizing systems from formal specifications, and that of formalizing REST – a popular web applications’ development pattern. For the synthesis problem, we distinguish between the synchronous and the asynchronous case. For the former, we solve a problem concerning a fundamental flaw in specification construction in previous work. We con...
متن کامل